Counting distinct palindromes in a word in linear time
نویسندگان
چکیده
a Université de Picardie Jules Verne, Laboratoire MIS, 33, rue Saint Leu, F-80039 Amiens cedex 1, France b Université de Rouen, LITIS EA-4108, 1, rue Thomas Becket, F-76821 Mont-St-Aignan cedex, France c Université Paul-Valéry Montpellier 3, UFR 4, Département MIAp, Route de Mende, 34199 Montpellier cedex 5, France d LIRMM (CNRS, Univ. Montpellier 2) – UMR 5506, 161, rue Ada, 34095 Montpellier cedex 5, France
منابع مشابه
Counting and Verifying Maximal Palindromes
A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is represented by a pair (c, r), where c is the center and r is the radius of the palindrome. We say that two strings w and z are pal-distinct if Pals(w) 6= Pals(z). Firstly, we describe the number of pal-distinct strings, and show...
متن کاملA connection between palindromic and factor complexity using return words
In this paper we prove that for any uniformly recurrent infinite word w, the following conditions are equivalent: (I) all complete returns to palindromes are palindromes; (II) P(n) + P(n+ 1) = C(n+ 1)− C(n) + 2 for all n, where P (resp. C) denotes the palindromic complexity (resp. factor complexity) function of w, which counts the number of distinct palindromic factors (resp. factors) of each l...
متن کاملA Classification of Trapezoidal Words
Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n≥ 0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal word is closed if its longest repeated prefix has exactly two occurrences in the word, the second one being a suffix of the word. Otherwise it is open...
متن کاملCounting Models of Linear-Time Temporal Logic
We investigate the model counting problem for safety specifications expressed in linear-time temporal logic (LTL). Model counting has previously been studied for propositional logic; in planning, for example, propositional model counting is used to compute the plan’s robustness in an incomplete domain. Counting the models of an LTL formula opens up new applications in verification and synthesis...
متن کاملسیستم شناسایی و طبقه بندی اسامی در متون فارسی
Name entity recognition (NER) is a system that can identify one or more kinds of names in a text and classify them into specified categories. These categories can be name of people, organizations, companies, places (country, city, street, etc.), time related to names (date and time), financial values, percentages, etc. Although during the past decade a lot of researches has been done on NER in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 110 شماره
صفحات -
تاریخ انتشار 2010